A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars
نویسندگان
چکیده
This paper solves a natural but still open question: can Abstract Categorial Grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that Non-Associative Lambek grammars as well as their derivations can be defined using ACGs of order two. To conclude, the outcomes of such a representation are discussed.
منابع مشابه
k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures
This paper is concerned with learning categorial grammars from positive examples in the model of Gold. Functor-argument structures (written FA) are usual syntactical decompositions of sentences in sub-components distinguishing the functional parts from the argument parts defined in the case of classical categorial grammars also known as AB-grammars. In the case of non-associative type-logical g...
متن کاملS4 enriched multimodal categorial grammars are context-free
Bar-Hillel et al. [1] prove that applicative categorial grammars weakly recognize the context-free languages. Buszkowski [2] proves that grammars based on the product-free fragment of the non-associative Lambek calculus NL recognize exactly the contextfree languages. Kandulski [7] furthers this result by proving that grammars based on NL also recognize exactly the context-free languages. Jäger ...
متن کاملOn the computation of joins for non associative Lambek categorial grammars
This paper deals with an application of unification and rewriting to Lambek categorial grammars used in the field of computational linguistics. Unification plays a crucial role in the acquisition of categorial grammar acquisition, as in [Kan98] ; a modified unification has been proposed [For01a] in this context for Lambek categorial grammars, to give an account of their logical part. This modif...
متن کاملRigid grammars in the Associative-Commutative Lambek Calculus are not learnable
In (Kanazawa, 1998) it was shown that rigid Classical Categorial Grammars are learnable (in the sense of (Gold, 1967)) from strings. Surprisingly there are recent negative results for, among others, rigid associative Lamb ek (L) grammars. In this paper the non-lcarnability of the class of rigid grammars in LP (Associative-Commutative Lambek calculus) and LP0 (same, but allowing the empty sequen...
متن کاملk-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures
This paper is concerned with learning categorial grammars in the model of Gold. We show that rigid and k-valued non-associative Lambek grammars are learnable from function-argument structured sentences. In fact, function-argument structures are natural syntactical decompositions of sentences in sub-components with the indication of the head of each sub-component. This result is interesting and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 19 شماره
صفحات -
تاریخ انتشار 2010